Implementation of a maximum clique search procedure on CUDA
نویسندگان
چکیده
منابع مشابه
Reactive Local Search for Maximum Clique: a New Implementation
This paper presents algorithmic and implementation enhancements of Reactive Local Search algorithm for the Maximum Clique problem [3]. In addition, we build an empirical complexity model for the CPU time required for a single iteration, and we show that with a careful implementation of the data-structures one can achieve a speedup of at least an order of magnitude difference for large size graphs.
متن کاملBreakout Local Search for maximum clique problems
The maximum clique problem (MCP) is one of the most popular combinatorial optimization problems with various practical applications. An important generalization of MCP is the maximum weight clique problem (MWCP) where a positive weight is associate to each vertex. In this paper, we present Breakout Local Search (BLS) which can be applied to both MC and MWC problems without any particular adapta...
متن کاملReactive Local Search for Maximum Clique
A heuristic algorithm is proposed for the solution of the Maximum-Clique problem in graphs. The algorithm is based on local search complemented by a \reactive" (history{sensitive) scheme to determine the amount of diversiication (Reactive Local Search, or RLS). The reaction acts on a parameter that determines the length of the temporary prohibition of selected moves in the neighborhood. The wor...
متن کاملVariable neighborhood search for the maximum clique
Maximum clique is one of the most studied NP-hard optimization problem on graphs because of its simplicity and its numerous applications. A basic variable neighborhood search heuristic for maximum clique that combines greedy with the simplicial vertex test in its descent step is proposed and tested on standard test problems from the literature. Despite its simplicity, the proposed heuristic out...
متن کاملSolving the maximum clique problem using a tabu search approach
We describe two variants of a tabu search heuristic, a deterministic one and a probabilistic one, for the maximum clique problem. This heuristic may be viewed as a natural alternative implementation of tabu search for this problem when compared to existing ones. We also present a new random graph generator, the/S-generator, which produces graphs with larger clique sizes than comparable ones obt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Heuristics
سال: 2018
ISSN: 1381-1231,1572-9397
DOI: 10.1007/s10732-018-9393-x